On maximum length convolutional codes under a trellis complexity constraint
نویسندگان
چکیده
منابع مشابه
The trellis complexity of convolutional codes
It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm [30,10]. It has gradually become apparent that linear block codes also/]ave a natural, though not in general a regular, "minimal" trellis structure, which allows them to be decoded with a Viterbi-1ike algorithn] [2,31,22,11,27,14,12,16,24,25,8,15]....
متن کاملOn (n, n-1) convolutional codes with low trellis complexity
We show that the state complexity profile of a convolutional code is the same as that of the reciprocal of the dual code of in case that minimal encoders for both codes are used. Then, we propose an optimum permutation for any given ( 1) binary convolutional code that will yield an equivalent code with the lowest state complexity. With this permutation, we are able to find many ( 1) binary conv...
متن کاملVariable-complexity trellis decoding of binary convolutional codes
We consider trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance “near” that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best accord...
متن کاملDimension/length profiles and trellis complexity of linear block codes
This semi-tutorial paper discusses the connections between the dimension/length profile (DLP) of a linear code, which is essentially the same as its " generalized Hamming weight hierarchy " 111, and the complexity of its minimal trellis diagram. These connections are close andtdeep. DLP duality is closely related to trellis duality. The DLP of a code gives tight bounds on its state and branch c...
متن کاملP2 Codes: Pragmatic Trellis Codes Utilizing Punctured Convolutional Codes
In a paper [ I ] , a pragmatic approach to the design of trellis codes was described whereby the basic engine of the trellis decoder was a Viterbi Decoder for the de facto industry and government standard, rate 1/2, 64state, convolutional code. In that paper, codes for 8PSK and 16-PSK modulation were described which performed almost as well as the best trellis codes of comparable complexity (fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2004
ISSN: 0885-064X
DOI: 10.1016/j.jco.2003.08.018